基于星敏感器的陀螺仪误差参数实时修正

主要研究导弹发射升空以后,通过星敏感器测星实现对捷联惯导系统中陀螺仪误差参数的实时修正技术。从传统的星光制导原理出发,通过对数学平台系失调角的分析,论证了基于单星敏感器情况下的陀螺仪误差参数分离方法,并给出了具体的仿真结果,对实际系统的使用具有一定的指导意义。     

UHMWPE复合材料抗爆实验研究

运用定制的聚偏四氟乙烯(PVDF)压电传感器,直接测量爆炸载荷下UHMWPE层叠无纬布和PU基体的UHMWPE复合材料内部冲击波压力峰值,对其冲击波衰减特性进行了实验研究。实验结果表明:UHMWPE复合材料对爆炸冲击波有很好的衰减作用,含有PU基体的UHMWPE复合材料比UHMWPE层叠无纬布对爆炸冲击波有更好的衰减效果。UHMWPE复合材料具有轻质、吸收冲击波效率高等特性,在爆炸冲击波防护领域有很好的应用前景。     

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

雷达间歇辅助下雷达红外协同跟踪技术

为了提高作战飞机的隐蔽性,提出了一种基于协方差的机载多传感器管理与辐射控制方法,给出了一种基于扩展卡尔曼滤波和交互多模型的雷达、红外序贯滤波的机载多传感器协同跟踪方法。对利用该方法的机载多传感器目标跟踪性能进行了仿真分析,仿真结果证明了该方法的合理性和有效性。     

一种能量高效和均衡的无线传感器网络分簇数据融合算法

在无线传感器网络中,如果传感器节点之间的能耗不均衡,一些能耗进度较快的节点会过快失效,继而导致网络过早无法正常工作。为了解决分簇无线传感器网络在数据收集过程中所存在的节点之间能耗不均衡问题,提出了一种新的分簇数据融合算法。该算法将网络划分为大小不等的栅格,并根据剩余能量使簇首分别在每个栅格的节点中轮转。簇首消耗的能量越多,其所在的栅格也越大,栅格内有更多节点参与簇首的轮换以分担能量负载。通过该方式,算法能够提高节点的能耗均衡程度。另外,考虑到无线传感器网络的能量受限,算法还采取了一系列措施以节约能量。仿真实验结果表明,算法在能量使用效率、网络生命周期以及能耗均衡程度三个方面都具有较好的性能。     

Batch scheduling with step‐deteriorating processing times to minimize flowtime

Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

维修任务调度的多目标决策模型

通过对维修调度问题进行分析,考虑到战斗力相关的多种目标因素,针对目前研究的目标单一,又未考虑武器的先进程度、配置等缺陷,就修复后的加权作战时间和装备尽可能少的延误数量双重目标加以研究,并给出了调度算法。从而弥补了这些缺陷,使调度更加合理。最后,算例表明模型的求解方法简单,计算时间较短,可有效地实现维修任务调度。     

水下传感器网络部署优化研究

水下传感器网络具有广阔的应用前景,但也存在能量有限、延迟较长、部署区域不连通和通信能耗大等问题,理论和实践证明传感器节点的优化部署是解决已上问题的有效方法。为此综合考虑水下传感器网络的工作环境及传感器特性,建立了提高网络可靠性的网络部署模型,给出了网络部署的成本函数及约束条件,并使用遗传算法对传感器节点和中转节点的部署成本及网络生命周期内的能量消耗进行优化。通过仿真实验表明,该模型收敛速度快,部署节点结果合理,达到了较好的优化网络的目的。     

A branch‐and‐price algorithm for parallel machine scheduling with time windows and job priorities

This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

联合作战规划中资源调度算法研究

以联合作战为例建立任务和作战平台资源模型,通过多维动态列表规划算法(Multidimensional Dynamic List Scheduling,MDLS)进行任务-平台分配,对平台选择提出了两种不同的优先权计算方法,通过对案例求解比较了不同方法的结果.